1787E - The Harmonization of XOR - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
    int n,k,x;
    cin >> n >> k >> x;
    n++;
    int cnt=0;
    int tx=0;
    bool visited[n]={};
    vector<int> xorx;
    for(int i=0;i<n;i++){
        if(!visited[i] && (i^x)<n){
            cnt++;
            visited[i^x]=true;
            xorx.push_back(i);
        }
        tx^=i;
    }
    if(tx!=0 && tx!=x){
        cout << "NO\n";
        return;
    }
    if((tx==0 && k%2!=0) || (tx==x && k%2==0)){
        cout <<"NO\n";
        return;
    }
    if(k>cnt){
        cout << "NO\n";
        return;
    }
    cout << "YES\n";
    bool added[n]={};
    for(int ii=0;ii<k-1;ii++){
        int i=xorx[ii];
        if(i==0 || i==x){
            cout << 1 << " " << x << "\n";
        } else cout << 2 << " " << i << " " << (i^x) << "\n";
        added[i]=true;
        added[i^x]=true;
    }
    vector<int> ladd;
    for(int i=1;i<n;i++){
        if(!added[i]) ladd.push_back(i);
    }
    cout << ladd.size() << " ";
    for(int i:ladd) cout << i << " ";
    cout << "\n";
}
int main(){
    int t;
    cin >> t;
    while(t--) solve();
}